P2P Decentralized Population Census

نویسندگان

  • Song Qin
  • Marius C. Silaghi
  • Toshihiro Matsui
  • Makoto Yokoo
  • Katsutoshi Hirayama
چکیده

We describe a framework and investigate techniques for running decentralized census processes that enable observers to independently verify governmental data. Census is a process impacting important issues such as the amount of funding that a community will get from a central government and its representation in the Congress. Correct census is essential for detecting vote stuffing. Census has been historically run by governments, but citizens and NGOs need to be able to verify it. Classical census is expensive and beyond the reach of these players, hence the need for affordable citizen-driven census technology. Various citizens have different opinions as to what information should be gathered and what makes a person eligible to be accounted for in statistics. Using as inputs the official preferences of a given government should enable the verification of the data of that government. The reported work formalizes this problem and introduces a framework and techniques for running a fully decentralized citizen-driven census based on peer-to-peer technology. An addressed challenge is to quantify the uncertainty and the trust in the data provided by P2P users, as well as to develop techniques for reducing this uncertainty. We report on techniques to reason and to extract census-related conclusions based on the available data. Probabilistic models with various approximations are experimented for evaluating the census results in this context.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heterogeneous Search in Unstructured Peer-to-Peer Networks

Resource search or discovery is a fundamental issue in peer-to-peer (P2P) and grid studies.1 Search objects, or resources, can be cycles, storage spaces, files, services, addresses, and so on. In general, systems are employing three categories of P2P-network architectures to improve search performance: centralized (such as Napster, http://www.napster.com/), decentralized but structured (such as...

متن کامل

P2P Evolution: From File-sharing to Decentralized Workflows

Peer-to-peer (P2P) computing is currently receiving a great deal of attention. Much of the current attention is focused on the use of P2P computing for exchanging media files. But P2P systems have actually been around for a long time and many application scenarios exist. In this paper we discuss on one hand the evolution of P2P middleware from simple file-sharing to decentralized data storage; ...

متن کامل

Diffusion Models for Peer-to-Peer (P2P) Media Distribution: On the Impact of Decentralized, Constrained Supply

In Peer-to-Peer (P2P) media distribution, users obtain content from other users who already have it. This form of decentralized product distribution demonstrates several unique features. Only a small fraction of users in the network are queried when a potential adopter seeks a file and many of these users may even free-ride i.e. not distribute the content to others. As a result, generated deman...

متن کامل

GOssiping Optimization Framework (GOOF): A decentralized P2P architecture for function optimization

This thesis discusses the implementation of function optimization algorithms through distributed and decentralized processing in a peer-to-peer fashion. Our research is focused on a fully decentralized, general purpose P2P environment, with no special or ad-hoc facility for executing optimization tasks. Relevant information is exchanged among nodes by means of epidemic protocols, exploiting the...

متن کامل

An Efficient Semantic Search Scheme for Decentralized P2P Environment

Peer-to-peer (P2P) is becoming prevalent on the Internet. However, due to the nature of exact hash matching, the DHT-based P2P itself doesn’t support decentralized semantic search. In this letter, we propose a Decentralized Unicode Suffix Tree Overlay (DUSTO), which can support multiple languages and keywords search. The simulation results indicate the average search length of DUSTO method is 7...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013